Satoshi Risk Tables

نویسندگان

  • Cyril Grunspan
  • Ricardo Pérez-Marco
چکیده

We present Bitcoin Security Tables computing the probability of success p(z, q, t) of a double spend attack by an attacker controlling a share q of the hashrate after z confirmations in time t.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Use of Primal-Dual Technique in the Network Algorithm for Two-Way Contingency Tables

The network algorithm of Mehta and Patel is one of the most efficient algorithms to execute a generalized Fisher’s exact test in two-way contingency tables. In this article an efficient algorithm for solving the longest path problem in the network algorithm is proposed. The efficiency of the proposed algorithm relies on the primal dual technique for convex network flow problems and the use of m...

متن کامل

Running head: Hyperuricemia predicts higher mortality of HFpEF

Relationship of hyperuricemia with mortality in heart failure patients 1 with preserved ejection fraction 2 3 Takeshi Shimizu, Akiomi Yoshihisa*, Yuki Kanno, Mai Takiguchi, Akihiko 4 Sato, Shunsuke Miura, Yuichi Nakamura, Hiroyuki Yamauchi, Takashi Owada, 5 Satoshi Abe1, Takamasa Sato1, Satoshi Suzuki1,2, Masayoshi Oikawa1, Takayoshi 6 Yamaki, Koichi Sugimoto, Hiroyuki Kunii, Kazuhiko Nakazato,...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Markov chain Monte Carlo tests for designed experiments

We consider conditional exact tests of factor effects in designed experiments for discrete response variables. Similarly to the analysis of contingency tables, a Markov chain Monte Carlo method can be used for performing exact tests, when large-sample approximations are poor and the enumeration of the conditional sample space is infeasible. For designed experiments with a single observation for...

متن کامل

MATHEMATICAL ENGINEERING TECHNICAL REPORTS Fibers of sample size two of hierarchical models and Markov bases of decomposable models for contingency tables

We study Markov bases of hierarchical models in general and those of decomposable models in particular for multiway contingency tables by determining the structure of fibers of sample size two. We prove that the number of elements of fibers of sample size two are powers of two and we characterizes the primitive moves of Markov bases in terms of connected components of a certain graph defined fr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1702.04421  شماره 

صفحات  -

تاریخ انتشار 2017